Modified Karnaugh Map for Quantum Boolean Circuits Construction
نویسنده
چکیده
Abstrnd-Karnaugh map is an efficient method of minimization for conventional logic design. Unfortunately, it is usually used for 3 or 4 variables, at most 6 variables. In this paper, we modify the Karnaugh map and propose a set of reduction rules for quantum Boolean circuit optimization. By applying these rules, we can efficiently simplify a quantum Boolean circuit that has an arbitrary number of input variables. In terms of the space consumption, we use only one auxiliary qubit as the output qubit, and keep all the input qubits unchanged.
منابع مشابه
Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
It is well known that the Karnaugh-map technique is an elegant teaching resource for academics and a systematic and powerful tool for a digital designer in minimizing low order Boolean functions. Why is the minimization of the Boolean expression needed? By simplifying the logic function, we can reduce the original number of digital components (gates) required to implement digital circuits. Ther...
متن کاملEfficient Solution of Boolean Equations Using Variable-Entered Karnaugh Maps
A new method for obtaining a compact subsumptive general solution of a system of Boolean equations is presented. The method relies on the use of the variable-entered Karnaugh map (VEKM) to achieve successive elimination through successive map folding. It also makes an artificial distinction between don’t-care and can’t-happen conditions. Therefore, it is highly efficient as it requires the cons...
متن کاملExtended K-map for Minimizing Multiple Output Logic Circuits
Minimization of multiple output functions of a digital logic circuit is a classic research problem. Minimal circuit is obtained by using multiple Karnaugh Maps (K-map), one for each function. In this paper we propose a novel technique that uses a single Karnaugh Map for minimizing multiple outputs of a single circuit. The algorithm basically accumulates multiple K-Maps into a single K-Map. Find...
متن کاملFormal Design Procedures for Differential Cascode Voltage Switch with Pass Gate (dcvspg) Logic
In this paper, a formal design approach for the differential cascode voltage switch with pass gate (DCVSPG) logic is presented. This permits the design of any combinational logic function by the use of a k-map or by a modified QuineMcCluskey algorithm. The basic design approach used is based on pass logic and shows that a DCVSPG logic gate designed with minimum number of transistors may not alw...
متن کاملModified Quine-McCluskey Method
The digital gates are basic electronic component of any digital circuit. Digital circuit should be simplified in order to reduce its cost by reducing number of digital gates required to implement it. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pair. Karnaugh map (K-map) and Quine-McCluskey (QM) methods are well kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004